Deterministic root finding over finite fields using Graeffe transforms
نویسندگان
چکیده
منابع مشابه
Irreducibility and Deterministic r-th Root Finding over Finite Fields
Constructing r -th nonresidue over a nite eld is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r e (where r is a prime) over a given nite eld Fq of characteristic p (equivalently, constructing the bigger eld Fqr e ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some ne...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملCharacter Sums and Deterministic Polynomial Root Finding in Finite Fields
Let Fq be a finite field of q elements of characteristic p. The classical algorithm of Berlekamp [1] reduces the problem of factoring polynomials of degree n over Fq to the problem of factoring squarefree polynomials of degree n over Fp that fully split in Fp, see also [8, Chapter 14]. Shoup [15, Theorem 3.1] has given a deterministic algorithm that fully factors any polynomial of degree n over...
متن کاملclassical wavelet transforms over finite fields
this article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. we present a concrete formulation for the frobenius norm of the classical wavelet transforms over finite fields. it is shown that each vector defined over a finite field can be represented as...
متن کاملHartley transforms over finite fields
A general f ramework is presented for constructing transforms in the field of the input which have a convolutionlike property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be v iewed as “projections” of the discrete Fourier transform @IT) and that they exist for all lengths ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2015
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s00200-015-0280-5